AntTree: A Web Document Clustering Using Artificial Ants
نویسندگان
چکیده
We present in this work a new algorithm for document hierarchical clustering and automatic generation of portals sites. This model is inspired from the self-assembling behavior observed in real ants where ants progressively get attached to an existing support and successively to other attached ants. The artificial ants that we have defined will similarly build a tree. Each ant represents one document. The way ants move and build this tree depends on the similarity between the documents. We have tested our model on sets of web pages extracted from internet and we have successfully compared our results to those obtained by the AHC (Ascending Hierarchical Clustering).
منابع مشابه
AntTree: a New Model for Clustering with Artificial Ants
In this paper we will present a new clustering algorithm for unsupervised learning. It is inspired from the self-assembling behavior observed in real ants where ants progressively become attached to an existing support and then successively to other attached ants. The artificial ants that we have defined will similarly build a tree. Each ant represents one data. The way ants move and build this...
متن کاملAdaptive clustering with artificial ants
Clustering task aims at the unsupervised classification of patterns (e.g., observations, data, vectors, etc.) in different groups. Clustering problem has been approached from different disciplines during the last years. Although have been proposed different alternatives to cope with clustering, there also exists an interesting and novel field of research from which different bio-inspired algori...
متن کاملA hierarchical ant based clustering algorithm and its use in three real-world applications
In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting themselves to each others. It is shown is this paper that this behavior can be used to build a hierarchical tree-structured partitioning of the data according to the similarities between those data. Several algorithms hav...
متن کاملClustering of Self-Organizing Map
In this paper, we present a new similarity measure for a clustering self-organizing map which will be reached using a new approach of hierarchical clustering. (1) The similarity measure is composed from two terms: weighted Ward distance and Euclidean distance weighted by neighbourhood function. (2) An algorithm inspired from artificial ants named AntTree will be used to cluster a self-organizin...
متن کاملHow to Use Ants for Hierarchical Clustering
We present in this paper, a new model for document hierarchical clustering, which is inspired from the self-assembly behavior of real ants. We have simulated the way ants build complex structures with different functions by connecting themselves to each other. Ants may thus build ”chains of ants” or form ”drops of ants”. The artificial ants that we have defined will similarly build a tree. Each...
متن کامل